A MATHEMATICA PACKAGE FOR q-HOLONOMIC SEQUENCES AND POWER SERIES
نویسندگان
چکیده
We describe a Mathematica package for dealing with q-holonomic sequences and power series. The package is intended as a q-analogue of the Maple package gfun and the Mathematica package GeneratingFunctions. It provides commands for addition, multiplication, and substitution of these objects, for converting between various representations (q-differential equations, q-recurrence equations, q-shift equations), for computing sequence terms and power series coefficients, and for guessing recurrence equations given initial terms of a sequence.
منابع مشابه
On Some Non-Holonomic Sequences
A sequence of complex numbers is holonomic if it satisfies a linear recurrence with polynomial coefficients. A power series is holonomic if it satisfies a linear differential equation with polynomial coefficients, which is equivalent to its coefficient sequence being holonomic. It is well known that all algebraic power series are holonomic. We show that the analogous statement for sequences is ...
متن کاملTHE sl3 JONES POLYNOMIAL OF THE TREFOIL: A CASE STUDY OF q-HOLONOMIC SEQUENCES
The sl3 colored Jones polynomial of the trefoil knot is a q-holonomic sequence of two variables with natural origin, namely quantum topology. The paper presents an explicit set of generators for the annihilator ideal of this q-holonomic sequence as a case study. On the one hand, our results are new and useful to quantum topology: this is the first example of a rank 2 Lie algebra computation con...
متن کاملComputer Algebra Algorithms for Orthogonal Polynomials and Special Functions
In this minicourse I would like to present computer algebra algorithms for the work with orthogonal polynomials and special functions. This includes • the computation of power series representations of hypergeometric type functions, given by “expressions”, like arcsin(x)/x , • the computation of holonomic differential equations for functions, given by expressions, • the computation of holonomic...
متن کاملFinding finite B2-sequences faster
A B2-sequence is a sequence a1 < a2 < · · · < ar of positive integers such that the sums ai + aj , 1 ≤ i ≤ j ≤ r, are different. When q is a power of a prime and θ is a primitive element in GF (q2) then there are B2-sequences A(q, θ) of size q with aq < q2, which were discovered by R. C. Bose and S. Chowla. In Theorem 2.1 I will give a faster alternative to the definition. In Theorem 2.2 I will...
متن کاملLazy Processing and Optimization of Discrete Sequences
We construct a small arithmetic package operating on discrete sequences: u0, u1, u2, . . . treated as single mathematical entities. Applying functions to sequences by the generalized map, or adding them element-wise is quite trivial, but if the sequences are regular, e.g. if they are arithmetic or geometric progressions, a much more compact and in several cases much more efficient representatio...
متن کامل